Fault Tolerant Topology Control with Unreliable Failure Detectors
نویسنده
چکیده
Wireless ad-hoc networking has emerged as its own discipline over the past decade and topology control is an important problem in such networks. The aim of topology control is to construct an appropriate topology to improve the efficiency and performance of the overlying algorithms (e.g., routing). Fault tolerance is a necessary feature of a topology to be applicable in realistic scenarios. This paper presents an analysis of the requirements to tolerate crash failures in the topology with the help of Failure detectors. We show that the class of perfect Failure detectors is strong enough to form a reliable underlay for routing and to avoid message loops.
منابع مشابه
Lower Bounds with Unreliable Failure Detectors (brief Announcement)
This paper takes place in the context of fault tolerant distributed computing. We investigate the eeciency of decision algorithm using unreliable failure detectors. We prove some lower bounds for Consensus Problem. In particular, we show that the longest message chain of all algorithms using a strong failure detector is greater than the number of processes, no matter the number of faulty proces...
متن کاملConstruction of a Fault - Tolerant Wireless Communication Topology for Networked Embedded Systems oder “ Implementing the Thallner - Algorithm ”
This master’s thesis presents a proven-correct implementation of a distributed topology construction algorithm based upon the Thallner topology construction method for creating a minimal ∆-node connected fault-tolerant overlay graph. The algorithm works in asynchronous fault-tolerant distributed systems augmented with failure detectors. A detailed proof shows that given a perfect propose module...
متن کاملGreatest Lower Bounds for Consensus using Unreliable Failure Detectors
This paper takes place in the context of fault tolerant distributed computing. We investigate the eeciency of consensus algorithms using unreliable failure detectors. For this, we consider two measures using the longest message chain before the decision and give greatest lower bounds for the main classes of failure detector. In particular, we show that the longest message chain of all algorithm...
متن کاملImplementing unreliable failure detectors with unknown membership
Unreliable failure detectors [3] are useful devices to solve several fundamental problems in fault-tolerant distributed computing, like consensus or atomic broadcast. In their original work [3], Chandra and Toueg proposed 8 different classes of unreliable failure detectors, and showed that all of them can be used to solve consensus in a crash-prone asynchronous system with reliable links. All t...
متن کاملStubborn Communication Channels
This paper aims at bridging the gap between the assumption of reliable channels by fault-tolerant distributed algorithms and the weak reliability of feasible communication channels. We deene a new kind of communication channels which we call Stubborn channels. Stubborn channels are easily implementable over a connectionless network layer and, although weak, the reliability guarantees ooered by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005